Limitations on quantum dimensionality reduction
نویسندگان
چکیده
منابع مشابه
Limitations on Quantum Dimensionality Reduction
The Johnson-Lindenstrauss Lemma is a classic result which implies that any set of n real vectors can be compressed to O(log n) dimensions while only distorting pairwise Euclidean distances by a constant factor. Here we consider potential extensions of this result to the compression of quantum states. We show that, by contrast with the classical case, there does not exist any distribution over q...
متن کاملCs 229r: Algorithms for Big Data 2 Dimensionality Reduction 2.2 Limitations of Dimensionality Reduction
In the last lecture we proved several space lower bounds for streaming algorithms using the communication complexity model, and some ideas from information theory. In this lecture we will move onto the next topic: dimensionality reduction. Dimensionality reduction is useful when solving high-dimensional computational geometry problems , such as: • clustering • nearest neighbors search • numeric...
متن کاملDimensionality Reduction on the Simplex
For many problems in data analysis, the natural way to model objects is as a probability distribution over a finite and discrete domain. Probability distributions over such domains can be represented as points on a (high-dimensional) simplex, and thus many inference questions involving distributions can be viewed geometrically as manipulating points on a simplex. The dimensionality of these poi...
متن کاملDimensionality Reduction
Dimensionality reduction studies methods that effectively reduce data dimensionality for efficient data processing tasks such as pattern recognition, machine learning, text retrieval, and data mining. We introduce the field of dimensionality reduction by dividing it into two parts: feature extraction and feature selection. Feature extraction creates new features resulting from the combination o...
متن کامل2D Dimensionality Reduction Methods without Loss
In this paper, several two-dimensional extensions of principal component analysis (PCA) and linear discriminant analysis (LDA) techniques has been applied in a lossless dimensionality reduction framework, for face recognition application. In this framework, the benefits of dimensionality reduction were used to improve the performance of its predictive model, which was a support vector machine (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Quantum Information
سال: 2015
ISSN: 0219-7499,1793-6918
DOI: 10.1142/s0219749914400012